A Bombieri–Vinogradov-type theorem with prime power moduli
نویسندگان
چکیده
In 2020, Roger Baker proved a result on the exceptional set of moduli in prime number theorem for arithmetic progressions following kind. Let $\mathcal {S}$ be pairwise coprime $q\le x^{9/40}$. Then primes $l\le x$ distribut
منابع مشابه
Parallel Linear Congruential Generators with Prime Moduli
Linear congruential generators (LCGs) remain the most popular method of pseudorandom number generation on digital computers. Ease of implementation has favored implementing LCGs with power-of-two moduli. However, prime modulus LCGs are superior in quality to power-of-two modulus LCGs, and the use of a Mersenne prime minimizes the computational cost of generation. When implemented for parallel c...
متن کاملFactoring RSA Moduli with Weak Prime Factors
In this paper, we study the problem of factoring an RSA modulus N = pq in polynomial time, when p is a weak prime, that is, p can be expressed as ap = u0 + M1u1 + . . . + Mkuk for some k integers M1, . . . ,Mk and k+2 suitably small parameters a, u0, . . . uk. We further compute a lower bound for the set of weak moduli, that is, moduli made of at least one weak prime, in the interval [2, 2] and...
متن کاملFinite groups with $X$-quasipermutable subgroups of prime power order
Let $H$, $L$ and $X$ be subgroups of a finite group$G$. Then $H$ is said to be $X$-permutable with $L$ if for some$xin X$ we have $AL^{x}=L^{x}A$. We say that $H$ is emph{$X$-quasipermutable } (emph{$X_{S}$-quasipermutable}, respectively) in $G$ provided $G$ has a subgroup$B$ such that $G=N_{G}(H)B$ and $H$ $X$-permutes with $B$ and with all subgroups (with all Sylowsubgroups, respectively) $...
متن کاملDirichlet Prime Number Theorem
In number theory, the prime number theory describes the asymptotic distribution of prime numbers. We all know that there are infinitely many primes,but how are they distributed? Dirichlet’s theorem states that for any two positive coprime integers a and d, there are infinitely many primes which are congruent to a modulo d. A stronger form of Dirichlet’s theorem states that the sum of the recipr...
متن کاملThe Prime Number Theorem
The Prime Number Theorem asserts that the number of primes less than or equal to x is approximately equal to x log x for large values of x (here and for the rest of these notes, log denotes the natural logarithm). This quantitative statement about the distribution of primes which was conjectured by several mathematicians (including Gauss) early in the nineteenth century, and was finally proved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2022
ISSN: ['0065-1036', '1730-6264']
DOI: https://doi.org/10.4064/aa210709-30-4